A Review of Dynamic Job Shop Scheduling Techniques
نویسندگان
چکیده
منابع مشابه
Survey of Job Shop Scheduling Techniques
Scheduling has been defined as "the art of assigning resources to tasks in order to insure the termination of these tasks in a reasonable amount of time" (1). According to French (2), the general problem is to find a sequence, in which the jobs (e.g., a basic task) pass between the resources (e.g., machines), which is a feasible schedule, and optimal with respect to some performance criterion. ...
متن کاملIntelligent Backtracking Techniques for Job Shop Scheduling
This paper studies a version of the job shop scheduling problem in which some operations have to be scheduled within non-relaxable time windows (i.e. earliest/latest possible start time windows). This problem is a wellknown NP-complete Constraint Satisfaction Problem (CSP). A popular method for solving these types of problems consists in using depthrst backtrack search. Our earlier work focused...
متن کاملJob-shop scheduling in a body shop
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain oper...
متن کاملA Comparison of Genetic Algorithms forthe Dynamic Job Shop Scheduling
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been applied to the Dynamic Job Shop Scheduling Problem (DJSSP) which is more similar to real-world applications. We implement a hybrid genetic algorithm for solving the dynamic job shop problem. A direct chromosome representati...
متن کاملA Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem
This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Manufacturing
سال: 2019
ISSN: 2351-9789
DOI: 10.1016/j.promfg.2019.02.006